Code spectrum and the reliability function: Binary symmetric channel
نویسندگان
چکیده
منابع مشابه
Code spectrum and the reliability function: Binary symmetric channel
A new approach for upper bounding the channel reliability function using the code spectrum is described. It allows to treat in a unified way both a low and a high rate cases. In particular, the earlier known upper bounds are improved, and a new derivation of the sphere-packing bound is presented.
متن کاملSupplement to: Code Spectrum and Reliability Function: Binary Symmetric Channel
A much simpler proof of Theorem 1 from [1] is presented below, using notation and formulas numeration of [1]. The text below replaces the subsection General case from §4 of [1, p. 11]. General case. In the general case for some ω we are interested in a pairs (xi,xj) with dij = ωn. But there may exist a pairs (xk,xl) with dkl < ωn. Using the “cleaning” procedure [2] we show that the influence of...
متن کاملCode spectrum and reliability function: Gaussian channel
A new approach for upper bounding the channel reliability function using the code spectrum is described. It allows to treat both low and high rate cases in a unified way. In particular, the earlier known upper bounds are improved, and a new derivation of the sphere-packing bound is presented.
متن کاملOn the Binary Symmetric Wiretap Channel
In this paper, we investigate the binary symmetric wiretap channel. We show that the secrecy capacity can be achieved by using random linear codes. Furthermore, we explore the coset coding scheme constructed by linear codes. As a result, we give an upper bound on the total information loss, which sheds light on the design of the applicable coset codes for the secure transmission with limited in...
متن کاملThermodynamics of the binary symmetric channel
We study a hidden Markov process which is the result of a transmission of the binary symmetric Markov source over the memoryless binary symmetric channel. This process has been studied extensively in Information Theory and is often used as a benchmark case for the so-called denoising algorithms. Exploiting the link between this process and the 1D Random Field Ising Model (RFIM), we are able to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Problems of Information Transmission
سال: 2006
ISSN: 0032-9460,1608-3253
DOI: 10.1134/s0032946006040016